Packing graphs in their complements
نویسندگان
چکیده
منابع مشابه
Clique Minors in Graphs and Their Complements
A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. Let t ≥ 1 be an integer, and let G be a graph on n vertices with no minor isomorphic to Kt+1. Kostochka conjectures that there exists a constant c = c(k) independent of G such that the complement of G has a minor isomorphic to Ks, where s = d2 (1 + 1/t)n − ce. We prove that Kostochka’s conjecture i...
متن کاملMaximum norms of graphs and their complements
Given a graph G; let kGk denote the trace norm of its adjacency matrix, also known as the energy of G: The main result of this paper states that if G is a graph of order n; then kGk + G (n 1) 1 +n ; where G is the complement of G: Equality is possible if and only if G is a strongly regular graph with parameters (n; (n 1) =2; (n 5) =4; (n 1) =4) ; known also as a conference graph. In fact, the a...
متن کاملLabeled embedding of (n, n-2)-graphs in their complements
21 Graph packing generally deals with unlabeled graphs. In [4], the authors 22 have introduced a new variant of the graph packing problem, called the 23 labeled packing of a graph. This problem has recently been studied on trees 24 [6] and cycles [4]. In this note, we present a lower bound on the labeled 25 packing number of any (n, n − 2)-graph into Kn. This result improves the 26 bound given ...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملOn the edge-integrity of some graphs and their complements
In this paper the authors study the edge-integrity of graphs. Edge-integrity is a very useful measure of the vulnerability of a network, in particular a communication network, to disruption through the deletion of edges. A number of problems are examined, including some Nordhaus-Gaddum type results. Honest graphs, i.e. those which have the maximum possible edge-integrity, are also investigated....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00186-6